Regular LDPC Lattices are Capacity-Achieving
نویسنده
چکیده
The concept and existence of sphere-boundachieving and capacity-achieving lattices has been explained on the AWGN channels by Forney [4]. In this paper we focus on regular LDPC lattices [7]. We introduce and investigate an ensemble of LDPC lattices with known properties. It is shown that these lattices are sphere-bound-achieving and capacityachieving.
منابع مشابه
On Universal Ldpc Codes over Memoryless Symmetric Channels
A design of robust error-correcting codes that achieve reliable communication over various channels is of great theoretical and practical interest. Such codes are termed universal. This paper considers the universality of lowdensity parity-check (LDPC) code ensembles over families of memoryless binary-input output-symmetric (MBIOS) channels. Universality is considered both under belief-propagat...
متن کاملImproved regular and semi-random rate-compatible low-density parity-check codes with short block lengths
Powerful rate-compatible codes are essential for achieving high throughput in hybrid automatic repeat request (ARQ) systems for networks utilising packet data transmission. The paper focuses on the construction of efficient rate-compatible low-density parity-check (RC-LDPC) codes over a wide range of rates. Two LDPC code families are considered; namely, regular LDPC codes which are known for go...
متن کاملFrom LDPC Codes to LDA Lattices: A Capacity Result
This paper contains a summary of the arguments used to show how to achieve capacity of the AWGN channel with Voronoi constellations of LDA lattices under lattice decoding. No dithering is required in the tranmission scheme and capacity is achievable with LDA lattices whose parity-check matrices have constant row and column degrees. Although most of the technical details of the proof cannot be t...
متن کاملCapacity-Achieving Codes for Noisy Channels with Bounded Graphical Complexity and Maximum Likelihood Decoding
In this paper, capacity-achieving codes for memoryless binary-input output-symmetric (MBIOS) channels under maximum-likelihood (ML) decoding with bounded graphical complexity are investigated. The graphical complexity of a code is defined as the number of edges in the graphical representation of the code per information bit and is proportional to the decoding complexity per information bit per ...
متن کاملODING for error correction is one of the many tools available for achieving reliable data transmission in communication system[4].Low-density parity-check (LDPC) codes are a class of linear block LDPC codes[4]. LPDC codes
This paper mainly about the study on one of the widely used error correcting codes that is Low parity check Codes (LDPC). In this paper, the Regular LDPC code has been discussed The LDPC codes explained in this paper is about the Regular Binary LDPC codes or the Gallager. Keywords—LDPC, channel coding.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1004.1749 شماره
صفحات -
تاریخ انتشار 2010